A Fast TSP Solver Using GA on JAVA
نویسندگان
چکیده
A hybrid algorithm using GA and heuristics for rapid solution of Travelling Salesperson Problems (TSP) is presented. We developed a JAVA program based on this algorithm. Visiting our web pages, everyone can easily try our TSP solver. Since JAVA programs are executable on many platforms, any one who design a new TSP algorithm can compare his own solver and ours on the same machine. Using our program as the criterion, TSP researchers can evaluate their algorithms objectively.
منابع مشابه
Study of Some Recent Crossovers Effects on Speed and Accuracy of Genetic Algorithm, Using Symmetric Travelling Salesman Problem
The Travelling Salesman Problem (TSP) is one of the most famous optimization problems. The Genetic Algorithm (GA) is one of metaheuristics that have been applied to TSP. The Crossover and mutation operators are two important elements of GA. There are many TSP solver crossover operators. In this paper, we state implementation of some recent TSP solver crossovers at first and then we use each of ...
متن کاملEfficient parallelization of the genetic algorithm solution of traveling salesman problem on multi-core and many-core systems
Efficient parallelization of genetic algorithms (GAs) on state-of-the-art multi-threading or many-threading platforms is a challenge due to the difficulty of schedulation of hardware resources regarding the concurrency of threads. In this paper, for resolving the problem, a novel method is proposed, which parallelizes the GA by designing three concurrent kernels, each of which running some depe...
متن کاملOpen Source Java Implementation of the Parallel Multi-thread Alternating Direction Isogeometric L2 Projections Solver for Material Science Simulations
This paper describes multi-thread parallel open source JAVA implementation of alternating directions isogeometric L2 projections solver. The solver enables for fast numerical simulations of time-dependent problems. To apply our solver, the time-dependent problem must be discretized using isogeometric finite element method with B-spline basis functions in the spatial domain. The problem is solve...
متن کاملEfficient and Off-The-Shelf Solver: jArgSemSAT
jArgSemSAT is a Java re-implementation of ArgSemSAT—a SATbased solver for abstract argumentation problems—that can be easily integrated in existing argumentation systems (1) as an off-the-shelf, standalone, library; (2) as a Tweety compatible library; and (3) as a fast and robust web service freely available on the Web. Despite being written in Java, jArgSemSAT is very efficient.
متن کاملGenetic Algorithm Based Solution for Tsp on a Sphere
The Traveling Salesman Problem (TSP) is one of the extensively studied combinatorial optimization problems. Various exact or approximation algorithms are devised for solving Euclidean TSP that determine the shortest route through a given set of points in 3-dimensional Euclidean space. In this paper, we proposed a genetic algorithm-based solution for TSP where all points are on the surface of a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999